Speeding Up Complex Video Copy Detection Queries.

Pattern detector fast detection of suspicious stream patterns for immediate reaction.

Mining and representing recommendations in actively evolving recommender systems.

Effiziente %C4hnlichkeitssuche und Data Mining in gro%DFen Multimediadatenbanken %28Efficient Adaptive Retrieval and Mining in Large Multimedia Databases%29.

Advances in Spatial and Temporal Databases
We present here a theory of motion from a topological point of view, in a symbolic perspective. Taking space-time histories of objects as primitive entities, we introduce temporal and topological relations on the thus defined space-time to characterize classes of spatial changes. The theory thus accounts for qualitative spatial information, dealing with underspecified, symbolic information when accurate data is not available or unnecessary. We show that these structures give a basis for commonsense spatio-temporal reasoning by presenting a number of significant deductions in the theory. This can serve as a formal basis for languages describing motion events in a qualitative way.
High%2DDimensional Indexing for Multimedia Features.

Efficient Adaptive Retrieval and Mining in Large Multimedia Databases.

Indexing density models for incremental learning and anytime classification on data streams.

Actively Building Private Recommender Networks for Evolving Reliable Relationships.

Self%2DAdaptive Anytime Stream Clustering.

Relevant Subspace Clustering Mining the Most Interesting Non%2Dredundant Concepts in High Dimensional Data.

DensEst Density Estimation for Data Mining in High Dimensional Spaces.

HSM Heterogeneous Subspace Mining in High Dimensional Data.

Robust Adaptable Video Copy Detection.

Evaluating Clustering in Subspace Projections of High Dimensional Data.
Clustering high dimensional data is an emerging research field. Subspace clustering or projected clustering group similar objects in subspaces, i.e. projections, of the full space. In the past decade, several clustering paradigms have been developed in parallel, without thorough evaluation and comparison between these paradigms on a common basis. Conclusive evaluation and comparison is challenged by three major issues. First, there is no ground truth that describes the “true ” clusters in real world data. Second, a large variety of evaluation measures have been used that reflect different aspects of the clustering result. Finally, in typical publications authors have limited their analysis to their favored paradigm only, while paying other paradigms little or no attention. In this paper, we take a systematic approach to evaluate the major paradigms in a common framework. We study representative clustering algorithms to characterize the different aspects of each paradigm and give a detailed comparison of their properties. We provide a benchmark set of results on a large variety of real world and synthetic data sets. Using different evaluation measures, we broaden the scope of the experimental analysis and create a common baseline for future developments and comparable evaluations in the field. For repeatability, all implementations, data sets and evaluation measures are available on our website 1. 1.
Anticipatory DTW for Efficient Similarity Search in Time Series Databases.
Time series arise in many different applications in the form of sensor data, stocks data, videos, and other time-related information. Analysis of this data typically requires searching for similar time series in a database. Dynamic Time Warping (DTW) is a widely used high-quality distance measure for time series. As DTW is computationally expensive, efficient algorithms for fast computation are crucial. In this paper, we propose a novel filter-and-refine DTW algorithm called Anticipatory DTW. Existing algorithms aim at efficiently finding similar time series by filtering the database and computing the DTW in the refinement step. Unlike these algorithms, our approach exploits previously unused information from the filter step during the refinement, allowing for faster rejection of false candidates. We characterize a class of applicable filters for our approach, which comprises state-of-the-art lower bounds of the DTW. Our novel anticipatory pruning incurs hardly any overhead and no false dismissals. We demonstrate substantial efficiency improvements in thorough experiments on synthetic and real world time series databases and show that our technique is highly scalable to multivariate, long time series and wide DTW bands. 1.
EDSC efficient density%2Dbased subspace clustering.

Pleiades Subspace Clustering and Evaluation.

The TS%2Dtree efficient time series search and retrieval.

Efficient similarity search using the Earth Mover%27s Distance for large multimedia databases.

OutRank ranking outliers in high dimensional data.

INSCY Indexing Subspace Clusters with In%2DProcess%2DRemoval of Redundancy.

Morpheus interactive exploration of subspace clustering.

SubClass Classification of Multidimensional Noisy Data Using Subspace Clusters.

Efficient EMD%2Dbased similarity search in multimedia databases via flexible dimensionality reduction.

Public microarray repository semantic annotation with ontologies employing text mining and expression profile correlation.

Clustering multidimensional sequences in spatial and temporal databases.
and temporal databases
AttentionAttractor efficient video stream similarity query processing in real time.

DUSC Dimensionality Unbiased Subspace Clustering.

Subspace outlier mining in large multimedia databases.

Clicks An effective algorithm for mining subspace clusters in categorical datasets.
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods,    mines subspace clusters. It uses a selective vertical method to guarantee complete search. Clicks outperforms previous approaches by over an order of magnitude and scales better than any of the existing method for high-dimensional datasets. These results are demonstrated in a comprehensive performance study on real and synthetic datasets.
An upper bound for transforming self%2Dverifying automata into deterministic ones.

VISA visual subspace clustering analysis.

Efficient multi%2Dstep query processing for EMD%2Dbased similarity.

Approximation Techniques for Indexing the Earth Mover%27s Distance in Multimedia Databases.

Spatial Multidimensional Sequence Clustering.

Adaptable Distance Functions for Similarity%2Dbased Multimedia Retrieval.

CLICKS an effective algorithm for mining subspace clusters in categorical datasets.
We present a novel algorithm called Clicks, that finds clusters in categorical datasets based on a search for k-partite maximal cliques. Unlike previous methods,    mines subspace clusters. It uses a selective vertical method to guarantee complete search. Clicks outperforms previous approaches by over an order of magnitude and scales better than any of the existing method for high-dimensional datasets. These results are demonstrated in a comprehensive performance study on real and synthetic datasets.
